2D Closest Pair Problem: A Closer Look
نویسندگان
چکیده
A closer look is taken at the well-known divide-andconquer algorithm for finding the closest pair of a set of points in the plane under the Euclidean distance. An argument is made that it is sufficient, and sometimes necessary, to check only the next three points following the current point associated with the y-sorted array in the combine phase of the algorithm.
منابع مشابه
A Closer Look at the Closest String and Closest Substring Problem
Let S be a set of k strings over an alphabet Σ; each string has a length between ` and n. The Closest Substring Problem (CSSP) is to find a minimal integer d (and a corresponding string t of length `) such that each string s ∈ S has a substring of length ` with Hamming distance at most d to t. We say t is the closest substring to S. For ` = n, this problem is known as the Closest String Problem...
متن کاملUpper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states σ1, . . . , σr. By splitting up the overall test into multiple binary tests in various ways we obtain a number of upper bounds on the optimal error probability in terms of the binary error probabilities. These upper bounds allow us to deduce various bounds on the asymptotic erro...
متن کاملThe Stereo Problem
Consider the pair of images in figure 1. At a first glance they may look identical but closer inspection shows small variations. In fact this is a stereo pair, a pair of images obtained from slightly different views, just like our left and right eyes see almost but not exactly the same things. As is discussed in the next section, and should be intuitively clear, the differences between the two ...
متن کاملOn Spatial-Range Closest-Pair Query
An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data sets indexed by R-trees. The closest pair in the whole space will be found via an optimzed R-tree join technique. However, this technique doesn’t perform well when the two data sets are identical. And it does...
متن کاملAn Entailment-Based Approach to the QA4MRE Challenge
This paper describes our entry to the 2012 QA4MRE Main Task (English dataset). The QA4MRE task poses a significant challenge as the expression of knowledge in the question and answer (in the document) typically substantially differs. Ultimately, one would need a system that can perform full machine reading – creating an internal model of the document’s meaning – to achieve high performance. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017